package my;


import my.algorithms.BinaryTree;
import my.datastructures.TreeNode;
import my.distributed.NodeDistributor;

public class Driver {

	/**
	 * @param args
	 */
	public static void main(String[] args) 
	{
		/*General.findFlaggedBitsSparse(6);
		General.findFlaggedBitsDense(6);
		BinaryTreeTester();*/
		System.out.println(NodeDistributor.GetHashKey("FooBar"));
	}
	
	private static void BinaryTreeTester()
	{
		TreeNode tree = new TreeNode(5);
		TreeNode leaf = new TreeNode(6);
		TreeNode leaf2 = new TreeNode(2);
		TreeNode leaf3 = new TreeNode(7);
		tree.right = leaf;
		tree.left = leaf2;
		leaf.right = leaf3;
		BinaryTree.inOrder(tree);
		BinaryTree.ReverseTree(tree);
		BinaryTree.inOrder(tree);
	}

}
